منابع مشابه
Hypergraph rewriting using conformisms
In this paper we study single-pushout transformation in a category of spans, a generalization of the notion of partial morphism in, for instance, 2,4]. As an application, single-pushout transformation in a category of hypergraphs with a special type of partial morphisms, the conformisms, is presented. In particular , we show the existence of the pushout of any pair of conformisms of hypergraphs...
متن کاملHypergraph Rewriting
In their pioneering paper [KB70], Knuth and Bendix showed that con uence (or, equivalently, the Church-Rosser property) is decidable for terminating term rewriting systems. It su ces to compute all critical pairs t s ! u of rewrite steps in which s is the superposition of the left-hand sides of two rules, and to check whether t and u reduce to a common term. This procedure is justi ed by the so...
متن کاملImplementing -reduction by Hypergraph Rewriting
The aim of this paper is to implement the-reduction in the-calculus with a hypergraph rewriting mechanism called collapsed-tree rewriting. It turns out that collapsed-tree rewriting is sound with respect to-reduction and complete with respect to the Gross-Knuth strategy. As a consequence, there exists a normal form for a collapsed-tree if and only if there exists a normal form for the represent...
متن کاملRewriting Queries using Views
Query rewriting is one of the oldest problems in data management. Earlier studies focused on improving performance of query evaluation [9], since using materialized views can save the execution cost of a query. In 1995, Levy et al. [10] formally studied the problem and developed complexity results. The problem became increasingly more important due to new applications such as data integration, ...
متن کاملMonitoring Programs Using Rewriting
We present a rewriting algorithm for efficiently testing future time Linear Temporal Logic (LTL) formulae on finite execution traces. The standard models of LTL are infinite traces, reflecting the behavior of reactive and concurrent systems which conceptually may be continuously alive. In most past applications of LTL, theorem provers and model checkers have been used to formally prove that dow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1995
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80198-7